Graphs of real functions with pathological behaviors
نویسنده
چکیده
A friend of mine This paper is dedicated to the memory of Franco Montagna. Franco was a dear friend of mine. I guess that, among the people who took part in the Conference in memoriam Franco Montagna, I am the person who has known him for the longest time: we were students together at the university of Pavia in the late Sixties. For our "tesi di laurea", in the early Seventies we went to Ferrara together to speak with Roberto Magari (at that time he was at the University of Ferrara), who was the thesis advisor for both of us. One year later Roberto Magari moved to Siena, and Franco and I obtained a fellowship from the CNR, the Italian science foundation. For many years Franco and I were colleagues and friends in Siena. I wish to recall our first trip to the United States: that time, as well, the two of us went to New York together for a couple of weeks. When I was in Siena, I was invited to have dinner at Franco and Tonina's house many times, I would say uncountably many times (I actually could never count the number of times I went there). In those years Tonina and Franco were true friends for me. Today I would like to say:
منابع مشابه
Initial coefficients of starlike functions with real coefficients
The sharp bounds for the third and fourth coefficients of Ma-Minda starlike functions having fixed second coefficient are determined. These results are proved by using certain constraint coefficient problem for functions with positive real part whose coefficients are real and the first coefficient is kept fixed. Analogous results are obtained for a general class of close-to-convex functions
متن کاملDouble Roman domination and domatic numbers of graphs
A double Roman dominating function on a graph $G$ with vertex set $V(G)$ is defined in cite{bhh} as a function$f:V(G)rightarrow{0,1,2,3}$ having the property that if $f(v)=0$, then the vertex $v$ must have at least twoneighbors assigned 2 under $f$ or one neighbor $w$ with $f(w)=3$, and if $f(v)=1$, then the vertex $v$ must haveat least one neighbor $u$ with $f(u)ge 2$. The weight of a double R...
متن کاملDecision-making and prepotent response inhibition functions in excessive internet users.
INTRODUCTION Excessive Internet use (EIU), also described as Internet addiction or pathological Internet use, has already become a serious social problem around the world. Some researchers consider EIU as a kind of behavioral addiction. However, there are few experimental studies on the cognitive functions of excessive Internet users (EIUers) and limited data are available to compare EIU with o...
متن کاملبررسی ارتباط کارکردهای اجرایی با علائم رفتاری در کودکان مبتلا به اختلال اُتیسم با عملکرد بالا
Objective: The relation between autism disorder’s symptoms and cognitive capabilities can help with a better phenotype description of this disorder and can facilitate its pathological evaluation and treatment. Destruction of executive functions seems to be one of the cognitive reasons of potential phenotype in autism disorder. Thus, the present paper aims to study the relationship between...
متن کاملFractal Dimension of Graphs of Typical Continuous Functions on Manifolds
If M is a compact Riemannian manifold then we show that for typical continuous function defined on M, the upper box dimension of graph(f) is as big as possible and the lower box dimension of graph(f) is as small as possible.
متن کاملAn Efficient Genetic Algorithm for Task Scheduling on Heterogeneous Computing Systems Based on TRIZ
An efficient assignment and scheduling of tasks is one of the key elements in effective utilization of heterogeneous multiprocessor systems. The task scheduling problem has been proven to be NP-hard is the reason why we used meta-heuristic methods for finding a suboptimal schedule. In this paper we proposed a new approach using TRIZ (specially 40 inventive principles). The basic idea of thi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Soft Comput.
دوره 21 شماره
صفحات -
تاریخ انتشار 2017